Diffuse reflection diameter in simple polygons
نویسندگان
چکیده
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
منابع مشابه
Reflected and Transmitted Irradiance from Area Sources Using Vertex Tracing
Computing irradiance analytically from polygonal luminaires in polygonal environments has proven effective for direct lighting applications in diffuse radiosity environments. Methods for analytic integration have traditionally used edge-based solutions to the irradiance integral; our previous work presented a vertex-based analytic solution, allowing irradiance to be computed incrementally by ra...
متن کاملAn Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Let s be a source point and t be a destination point inside an n-vertex simple polygon P . Euclidean shortest paths [Lee and Preparata, Networks, 1984; Guibas et al. , Algorithmica, 1987] and minimum-link paths [Suri, CVGIP, 1986; Ghosh, J. Algorithms, 1991] between s and t inside P have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal pat...
متن کاملOn convexification of polygons by pops
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملObscurances in general environments
Obscurances is a powerful, simple and robust technique to simulate global illumination of a scene with much lower cost than other global illumination techniques like radiosity or path tracing. On the one hand, this technique has been used to compute the indirect lighting of diffuse scenes in videogames using lightmaps. In this context, it has been even proven useful to recompute in real time th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 210 شماره
صفحات -
تاریخ انتشار 2016